int findMaxConsecutiveOnes(int* nums, int numsSize) 
{ 
	int max_count = 0, cur_size = 0;
	for (int i = 0; i < numsSize; i++) 
	{ 
		if (nums[i] == 1) 	{ 
			cur_size++; 
		} 
		else {
			max_count = max_count > cur_size ? max_count : cur_size; 
			cur_size = 0; 
		} 
	}
	max_count = max_count > cur_size ? max_count : cur_size;
	return max_count; 
}